UPGMA clustering revisited: A weight-driven approach to transitive approximation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Multi-Objective Approach to Fuzzy Clustering using ITLBO Algorithm

Data clustering is one of the most important areas of research in data mining and knowledge discovery. Recent research in this area has shown that the best clustering results can be achieved using multi-objective methods. In other words, assuming more than one criterion as objective functions for clustering data can measurably increase the quality of clustering. In this study, a model with two ...

متن کامل

A Flexible Clustering Method Based on UPGMA and ISS

A formula is given for a flexible combinatorial clustering strategy, having UPGMA and ISS as special cases. When numerical clustering methods are used to investigate the structure of taxonomic groups, it is common practice to try several methods, having different clustering intensities. For example, one might use single linkage (weak), UPGMA (medium), and complete linkage (strong) (Sneath and S...

متن کامل

‏‎a 10-bit 50-ms/s parallel successive-approximation analog-to-digital converter‎‏

‏‎applications such as high definition viedeo reproduction, portable computers, wireless, and multimedia demand, and ever-increasing need for ligh-frequency high-resolution and low-power analog-to-digital converters. flash, two-step flash, and pipeline convertors are fast but consume large amount of power and require large area. to overcome these problems, successive approximation converter blo...

15 صفحه اول

An Algorithm to Compute the Transitive Closure, a Transitive Approximation and a Transitive Opening of a Fuzzy Proximity

A method to compute the transitive closure, a transitive opening and a transitive approximation of a reflexive and symmetric fuzzy relation is given. Other previous methods in literature compute just the transitive closure, some transitive approximations or some transitive openings. The proposed algorithm computes the three different similarities that approximate a proximity for the computation...

متن کامل

Antiflag-transitive collineation groups revisited

An antiflag in a projective space is a non-incident point-hyperplane pair. A subgroup G of ΓL(n,q) is antiflag-transitive if it acts transitively on the set of antiflag of PG(n−1,q). In 1979, Cameron and Kantor [2] published a paper determining all antiflagtransitive subgroups of ΓL(n,q). A large part of the motivation was the fact that a group which acts 2-transitively on points is necessarily...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Approximate Reasoning

سال: 2006

ISSN: 0888-613X

DOI: 10.1016/j.ijar.2005.11.001